Generalised monotone line search algorithm for degenerate nonlinear minimax problems
نویسندگان
چکیده
منابع مشابه
Nonmonotone Line Search for Minimax Problems
It was recently shown that, in the solution of smooth constrained optimization problems by sequential quadratic programming (SQP), the Maratos eeect can be prevented by means of a certain nonmonotone (more precisely, three-step or four-step monotone) line search. Using a well known transformation, this scheme can be readily extended to the case of minimax problems. It turns out however that, du...
متن کاملA Semismooth Active-set Algorithm for Degenerate Nonlinear Complementarity Problems
We propose a semismooth active-set Newton algorithm for solving the nonlinear complementarity problems with degenerate solutions. This method introduces the active-set technique to identify the degenerate set. At each iteration, the search direction is obtained by two reduced linear systems. Instead of employing gradient steps as adjustments to guarantee the sufficient reduction of the merit fu...
متن کاملNonlinear Degenerate Diffusion Problems
Self similar solutions u(x,t) = f(x//t) of the one-dimensional porousmedium equation are studied in this paper. These solutions emerge frominitial values that consist of two constant states: one non-positive forx < 0 and one non-negative for x > 0. With a diffusivity of the form|u| , we consider for m > 0 sign change solutions and for m e (-1,0]non-negative solutions. Th...
متن کاملA Genetic Algorithm for Minimax Optimization Problems
Robust discrete optimization is a technique for structuring uncertainty in the decision-making process. The objective is to find a robust solution that has the best worst-case performance over a set of possible scenarios. However, this is a difficult optimization problem. This paper proposes a two-space genetic algorithm as a general technique to solve minimax optimization problems. This algori...
متن کاملA Particle Swarm Optimization Algorithm for Mixed-Variable Nonlinear Problems
Many engineering design problems involve a combination of both continuous anddiscrete variables. However, the number of studies scarcely exceeds a few on mixed-variableproblems. In this research Particle Swarm Optimization (PSO) algorithm is employed to solve mixedvariablenonlinear problems. PSO is an efficient method of dealing with nonlinear and non-convexoptimization problems. In this paper,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 2006
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700038673